Nuprl Lemma : gcd-reduce 11,40

p,q:g:. (a,b,x,y:. ((p = (a * g))  (q = (b * g))  (((x * a) + (y * b)) = 1))) 
latex


DefinitionsA c B, guard(T), sq_type(T), P  Q, P  Q, has-value(a), lelt(ijk), , int_seg(ij), int_nzero, prop{i:l}, P  Q, , x:AB(x), nequal(Tab), False, A, A  B, ge(ij), P  Q, t  T, x:AB(x), P  Q, decidable(P)
Lemmasmul assoc, decidable le, absval zero, not functionality wrt iff, sign-absval, sign-squared, add functionality wrt eq, sign wf, absval wf, mul add distrib, rem bounds 1, div rem sum, nequal wf, divide wfa, le wf, decidable int equal, ge wf, nat properties, int seg wf, nat wf

origin